Buying Time for Resource-Bounded Planning

نویسندگان

  • Ella M. Atkins
  • Edmund H. Durfee
  • Kang G. Shin
چکیده

To react appropriately in hard real-time environments, a system must either employ fast dynamic planning or recall a pre-built reactive response. For complex problems, real-time, accurate dynamic planning may be impossible, and the complete set of possible reactions may be too large to build and store in advance. In this paper, we propose combining offiine and online planning such that a set of offline plans are built and stored to maximize the amount of time available for any subsequent online planning. We explore this concept in CIRCA, the Cooperative Intelligent Real-time Control Architecture, which has concentrated on guaranteeing failure avoidance via a combination of planning, scheduling, and real-time plan execution. We are in the process of implementing a plan cache which will increase CIRCA’s overall likelihood of success in timeconstrained situations, and we illustrate potential gains from these modifications using a simple example from the fully-automated aircraft domain.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Bounded Q-decomposition RDTP Approach to Resource Allocation

This paper contributes to solve effectively stochastic resource allocation problems known to be NP-Complete. To address this complex resource management problem, two approaches are adapted and merged in an effective way: the Q-decomposition and the bounded Real-time Dynamic Programming (bounded rtdp). The Q-decomposition allows to coordinate reward separated agents and thus permits to reduce th...

متن کامل

Bounded-Resource Reasoning as (Strong or Classical) Planning

To appropriately configure agents so as to avoid resource exhaustion, it is necessary to determine the minimum resource (time & memory) requirements necessary to solve reasoning problems. In this paper we show how the problem of reasoning under bounded resources can be recast as a planning problem. Focusing on propositional reasoning, we propose different recasting styles, which are equally int...

متن کامل

Constraint-Directed Reasoning as a Basis for Real-Time Planning

Constraint-directed reasoning has emerged as a powerful problem-solving paradigm used widely in artificial intelligence applications. This paper explores the use of constraints as a foundation for real-time planning in complex domains. We describe the function of constraints as a mechanism for representing and working with domain knowledge in resource bounded agents, and examine the types and o...

متن کامل

AN EFFECTIVE METHOD FOR SIMULTANEOUSLY CONSIDERING TIME-COST TRADE-OFF AND CONSTRAINT RESOURCE SCHEDULING USING NONLINEAR INTEGER FRAMEWORK

Critical Path Method (CPM) is one of the most popular techniques used by construction practitioners for construction project scheduling since the 1950s. Despite its popularity, CPM has a major shortcoming, as it is schedule based on two impractical acceptance that the project deadline is not bounded and that resources are unlimited. The analytical competency and computing capability of CPM thus...

متن کامل

ROBUST RESOURCE-CONSTRAINED PROJECT SCHEDULING WITH UNCERTAIN-BUT-BOUNDED ACTIVITY DURATIONS AND CASH FLOWS I. A NEW SAMPLING-BASED HYBRID PRIMARY-SECONDARY CRITERIA APPROACH

This paper, we presents a new primary-secondary-criteria scheduling model for resource-constrained project scheduling problem (RCPSP) with uncertain activity durations (UD) and cash flows (UC). The RCPSP-UD-UC approach producing a “robust” resource-feasible schedule immunized against uncertainties in the activity durations and which is on the sampling-based scenarios may be evaluated from a cos...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997